Ore-type versions of Brooks' theorem

نویسندگان

Hal A. Kierstead

Alexandr V. Kostochka

چکیده

Article history: Received 1 September 2007 Available online 22 July 2008

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Improvement on Brooks’ Theorem

We prove that χ(G) ≤ max { ω(G),∆2(G), 5 6 (∆(G) + 1) } for every graph G with ∆(G) ≥ 3. Here ∆2 is the parameter introduced by Stacho that gives the largest degree that a vertex v can have subject to the condition that v is adjacent to a vertex whose degree is at least as large as its own. This upper bound generalizes both Brooks’ Theorem and the Ore-degree version of Brooks’ Theorem.

متن کامل

FUZZY QUASI-METRIC VERSIONS OF A THEOREM OF GREGORI AND SAPENA

We provide fuzzy quasi-metric versions of a fixed point theorem ofGregori and Sapena for fuzzy contractive mappings in G-complete fuzzy metricspaces and apply the results to obtain fixed points for contractive mappingsin the domain of words.

متن کامل

Extracting List Colorings from Large Independent Sets

We take an application of the Kernel Lemma by Kostochka and Yancey [10] to its logical conclusion. The consequence is a sort of magical way to draw conclusions about list coloring (and online list coloring) just from the existence of an independent set incident to many edges. We use this to prove an Ore-degree version of Brooks’ Theorem for online list-coloring. The Ore-degree of an edge xy in ...

متن کامل